Ends in digraphs

Ends in Digraphs

0n removable cycles in graphs and digraphs

In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...

More skew-equienergetic digraphs

Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. Recently this problem was solved by Ramane et al. In this  paper, we give some new methods to construct new skew-equienergetic digraphs.

On Ends-to-Ends Encryption

In the past few years secure messaging has become mainstream, with over a billion active users of end-to-end encryption protocols through apps such as WhatsApp, Signal, Facebook Messenger, Google Allo, Wire and many more. While these users’ two-party communications now enjoy very strong security guarantees, it turns out that many of these apps provide, without notifying the users, a weaker prop...

Ends-in vs. ends-out recombination in yeast.

Integration of linearized plasmids into yeast chromosomes has been used as a model system for the study of recombination initiated by double-strand breaks. The linearized plasmid DNA recombines efficiently into sequences homologous to the ends of the DNA. This efficient recombination occurs both for the configuration in which the break is in a contiguous region of homology (herein called the en...